We determine the linear complexity of binary sequences derived from the polynomial quotient modulo p defined by $F(u)equiv rac{f(u)-f_p(u)}{p} ~(mod~ p), qquad 0 le F(u) le p-1,~uge 0,$ where fp(u)≡f(u) (mod p), for general polynomials $f(x)in mathbb{Z}[x]$. The linear complexity equals to one of the following values {p2-p,p2-p+1,p2-1,p2} if 2 is a primitive root modulo p2, depending on p≡1 or 3 modulo 4 and the number of solutions of f'(u)≡0 (mod) p, where f'(x) is the derivative of f(x). Furthermore, we extend the constructions to d-ary sequences for prime d|(p-1) and d being a primitive root modulo p2.

Let p be an odd prime number. We define a family of quaternary sequences of period 2p using generalized cyclotomic classes over the residue class ring modulo 2p. We compute exact values of the linear complexity, which are larger than half of the period. Such sequences are 'good' enough from the viewpoint of linear complexity.

Based on the cyclotomy classes of extension fields, a family of binary cyclotomic sequences are constructed and their pseudorandom measures (i.e., the well-distribution measure and the correlation measure of order k) are estimated using certain exponential sums. A lower bound on the linear complexity profile is also presented in terms of the correlation measure.

Linear codes with a few-weight have important applications in combinatorial design, strongly regular graphs and cryptography. In this paper, we first construct a class of Boolean functions with at most five-valued Walsh spectra, and determine their spectrum distribution. Then, we derive two classes of linear codes with at most six-weight from the new functions. Meanwhile, the length, dimension and weight distributions of the codes are obtained. Results show that both of the new codes are minimal and among them, one is wide minimal code and the other is a narrow minimal code and thus can be used to design secret sharing scheme with good access structures. Finally, some Magma programs are used to verify the correctness of our results.

Low-hit-zone frequency-hopping sequences (LHZ-FHSs) are frequency-hopping sequences with low Hamming correlation in a low-hit-zone (LHZ), which have important applications in quasi-synchronous communication systems. However, the strict quasi-synchronization may be hard to maintain at all times in practical FHMA networks, it is also necessary to minimize the Hamming correlation for time-shifts outside of the LHZ. The main objective of this letter is to propose a lower bound on the maximum correlation magnitude outside the low-hit-zone for LHZ-FHS sets. It turns out that the proposed bound is tight or almost tight in the sense that it can be achieved by some LHZ-FHS sets.

Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.

MICKEY-family ciphers are lightweight cryptographic primitives and include a register R determined by two related maximal-period linear transformations. Provided that primitivity is efficiently decided in finite fields, it is shown by quantitative analysis that potential parameters for R can be found in probabilistic polynomial time.

Linear codes with a few weights have many applications in secret sharing schemes, authentication codes, association schemes and strongly regular graphs, and they are also of importance in consumer electronics, communications and data storage systems. In this paper, based on the theory of defining sets, we present a class of five-weight linear codes over $mathbb{F}_p$(p is an odd prime), which include an almost optimal code with respect to the Griesmer bound. Then, we use exponential sums to determine the weight distribution.

The global avalanche characteristics measure the overall avalanche properties of Boolean functions, an n-variable balanced Boolean function of the sum-of-square indicator reaching σƒ=22n+2n+3 is an open problem. In this paper, we prove that there does not exist a balanced Boolean function with σƒ=22n+2n+3 for n≥4, if the hamming weight of one decomposition function belongs to the interval Q*. Some upper bounds on the order of propagation criterion of balanced Boolean functions with n (3≤n≤100) variables are given, if the number of vectors of propagation criterion is equal and less than 7·2n-3-1. Two lower bounds on the sum-of-square indicator for balanced Boolean functions with optimal autocorrelation distribution are obtained. Furthermore, the relationship between the sum-of-squares indicator and nonlinearity of balanced Boolean functions is deduced, the new nonlinearity improves the previously known nonlinearity.

Codebooks with good parameters are preferred in many practical applications, such as direct spread CDMA communications and compressed sensing. In this letter, an upper bound on the set size of a codebook is introduced by modifying the Levenstein bound on the maximum amplitudes of such a codebook. Based on an estimate of a class of character sums over a finite field by Katz, a family of codebooks nearly meeting the modified bound is proposed.

We introduce the r-ary sequence with period 2p2 derived from Euler quotients modulo 2p (p is an odd prime) where r is an odd prime divisor of (p-1). Then based on the cyclotomic theory and the theory of trace function in finite fields, we give the trace representation of the proposed sequence by determining the corresponding defining polynomial. Our results will be help for the implementation and the pseudo-random properties analysis of the sequences.

Construction of resilient Boolean functions in odd variables having strictly almost optimal (SAO) nonlinearity appears to be a rather difficult task in stream cipher and coding theory. In this paper, based on the modified High-Meets-Low technique, a general construction to obtain odd-variable SAO resilient Boolean functions without directly using PW functions or KY functions is presented. It is shown that the new class of functions possess higher resiliency order than the known functions while keeping higher SAO nonlinearity, and in addition the resiliency order increases rapidly with the variable number n.

A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.

We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (e > 2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values.

Event-centered information integration is regarded as one of the most pressing issues in improving disaster emergency management. Ontology plays an increasingly important role in emergency information integration, and provides the possibility for emergency reasoning. However, the development of event ontology for disaster emergency is a laborious and difficult task due to the increasingly scale and complexity of emergencies. Ontology pattern is a modeling solution to solve the recurrent ontology design problem, which can improve the efficiency of ontology development by reusing patterns. By study on characteristics of numerous emergencies, this paper proposes a generic ontology pattern for emergency system modeling. Based on the emergency ontology pattern, a set of reasoning rules for emergency-evolution, emergency-solution and emergency-resource utilization reasoning were proposed to conduct emergency knowledge reasoning and q.

The notion of the signal-to-noise ratio (SNR), proposed by Guilley, et al. in 2004, is a property that attempts to characterize the resilience of (n, m)-functions F=(f1,...,fm) (cryptographic S-boxes) against differential power analysis. But how to study the signal-to-noise ratio for a Boolean function still appears to be an important direction. In this paper, we give a tight upper and tight lower bounds on SNR for any (balanced) Boolean function. We also deduce some tight upper bounds on SNR for balanced Boolean function satisfying propagation criterion. Moreover, we obtain a SNR relationship between an n-variable Boolean function and two (n-1)-variable decomposition functions. Meanwhile, we give SNR(f⊞g) and SNR(f⊡g) for any balanced Boolean functions f, g. Finally, we give a lower bound on SNR(F), which determined by SNR(fi) (1≤i≤m), for (n, m)-function F=(f1,f2,…,fm).

A new class of sextic residue sequences of period prime p=4u2+27=6f+1 ≡ 3 ( mod 8) are presented. Their trace function representations are determined. And the exact value of the linear complexity is derived from the trace function representations. The result indicates that the new sextic sequences are quite good from the linear complexity viewpoint.

This correspondence contributes to some d-form functions and d-form sequences. A property of d-form functions is obtained firstly. Then we present a way to construct d-form sequences and extended d-form sequences with ideal autocorrelation. Based on our result, many sequences with ideal autocorrelation can be constructed by the corresponding difference-balanced d-form functions.

Linear codes have wide applications in many fields such as data storage, communication, cryptography, combinatorics. As a subclass of linear codes, minimal linear codes can be used to construct secret sharing schemes with good access structures. In this paper, we first construct some new classes of linear codes by selecting definition set properly. Then, the lengths, dimensions and the weight distribution of the codes are determined by investigating whether the intersections of the supports of vectors and the definition sets are empty. Results show that both wide and narrow minimal linear codes are contained in the new codes. Finally, we extend some existing results to general cases.

The calculation of cross-correlation between a sequence with good autocorrelation and its decimated sequence is an interesting problem in the field of sequence design. In this letter, we consider a class of ternary sequences with perfect autocorrelation, proposed by Shedd and Sarwate (IEEE Trans. Inf. Theory, 1979, DOI: 10.1109/TIT.1979.1055998), which is generated based on the cross-correlation between m-sequence and its d-decimation sequence. We calculate the cross-correlation distribution between a certain pair of such ternary perfect sequences and show that the cross-correlation takes three different values.